Correlated Equilibria in Nonzero-Sum Differential Games
نویسندگان
چکیده
منابع مشابه
Approximating Nash Equilibria in nonzero-Sum Games
This paper deals with the approximation of Nash-equilibria in m-player games. We present conditions under which an approximating sequence of games admits near-equilibria that approximate near equilibria in the limit game. We apply the results to two classes of games: (i) a duopoly game approximated by a sequence of matrix games; (ii) a stochastic game played under the S-adapted information stru...
متن کاملGeneral-Sum Games: Correlated Equilibria
This lecture introduces a generalization of Nash equilibrium due to Aumann [1] known as correlated equilibrium, which allows for possible dependencies in strategic choices. A daily example of a correlated equilibrium is a traffic light: a red (green) signal suggests that cars should stop (go), and following each suggestion is of course rational. Following Aumann [2], we present two definitions ...
متن کاملTeaching Nonzero Sum Games Using a Diagrammatic Determination of Equilibria
W present a diagrammatic method that allows the determination of all Nash equilibria of 2×M nonzero sum games, extending thus the well known diagrammatic techniques for 2 × M zero sum and 2 × 2 nonzero sum games. We show its appropriateness for teaching purposes by analyzing modified versions of the prisoners’ dilemma, the battle of the sexes, as well as of the zero sum game of matching pennies...
متن کاملNonzero - Sum Stochastic Games
This paper extends the basic work that has been done on tero-sum stochastic games to those that are nonzerosum. Appropriately defined equilibrium points are shown to exist for both the case where the players seek to maximize the total value of their discounted period rewards and the case where they wish to maximize their average reward per period. For the latter case, conditions required on the...
متن کاملFinding Correlated Equilibria in General Sum Stochastic Games
Often problems arise where multiple self-interested agents with individual goals can coordinate their actions to improve their outcomes. We model these problems as general sum stochastic games. We develop a tractable approximation algorithm for computing subgame-perfect correlated equilibria in these games. Our algorithm is an extension of standard dynamic programming methods like value iterati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1993
ISSN: 0022-247X
DOI: 10.1006/jmaa.1993.1138